∗-autonomous Categories in Quantum Theory

نویسنده

  • BRIAN J. DAY
چکیده

So-called ∗-autonomous, or “Frobenius”, category structures occur widely in mathematical quantum theory. This trend was observed in [3], mainly in relation to Hopf algebroids, and continued in [8] with a general account of Frobenius monoids. Below we list some of the ∗-autonomous partially ordered sets A = (A , p, j, S) that appear in the literature, an abstract definition of ∗-autonomous promonoidal structure being made in [3, §7]. Without going into much detail, we also note some features of the convolution [A ,V ] (defined in [1]) of a given such A with a complete ∗-autonomous monoidal category V . A monoidal functor category of this type is a completion of A , with an appropriate universal property; it is always again ∗-autonomous (as seen in [3] for example). The basic descriptions of promonoidal (equals premonoidal) structure and the resulting convolution product are given in [1] and [3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories

Toy models have been used to separate important features of quantum computation from the rich background of the standard Hilbert space model. Category theory, on the other hand, is a general tool to separate components of mathematical structures, and analyze one layer at a time. It seems natural to combine the two approaches, and several authors have already pursued this idea. We explore catego...

متن کامل

Designing a Quantum Leadership Model in Secondary Schools Based on Data Theory

This study seeks to design a new and innovative model for school management using the data foundation method, a model that can be an effective aid in solving the problems and challenges facing school principals by using quantum leadership. Designing a quantum leadership model in secondary schools based on data theory is the main goal of this research and seeks to achieve a suitable model for ov...

متن کامل

Towards a semantics for higher-order quantum computation∗

The search for a semantics for higher-order quantum computation leads naturally to the study of categories of normed cones. In the first part of this paper, we develop the theory of continuous normed cones, and prove some of their basic properties, including a Hahn-Banach style theorem. We then describe two different concrete ∗-autonomous categories of normed cones. The first of these categorie...

متن کامل

Complexity of Grammar Induction for Quantum Types

Most categorical models of meaning use a functor from the syntactic category to the semantic category. When semantic information is available, the problem of grammar induction can therefore be defined as finding preimages of the semantic types under this forgetful functor, lifting the information flow from the semantic level to a valid reduction at the syntactic level. We study the complexity o...

متن کامل

Coherence for Frobenius pseudomonoids and the geometry of linear proofs

Frobenius pseudomonoids are higher-dimensional algebraic structures, first studied by Street [34], which categorify the classical algebraic notion of Frobenius algebra [24]. These higher algebraic structures have an important application to logic, since Frobenius pseudomonoids in the bicategory of categories, profunctors and natural transformations, for which the multiplication and unit have ri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006